|
|
Script Language for Image Processing
Crlík, Radek ; Španěl, Michal (referee) ; Zemčík, Pavel (advisor)
This bachelor thesis deals with capabilities of scripting languages and their types. Specifically with design of one such language suitable for image processing. The goal was to create a language small enough, but easy to use. One of the requirement was to utilize OpenCV library, for which the resulting code would be as short as possible. First part deals with descriptions of scripting languages, their main philosophy and options of language processing by the computer. Second part contains description of the designed language. Last part documents achieved goals and possible ways how to extend the language even further.
|
|
|
A frequency inverter based on Texas Instruments DSP
Vašíček, Adam ; Macho, Tomáš (referee) ; Valach, Soběslav (advisor)
This bachelor thesis is focused on control algorithms optimization, especially using the Texas Instruments c2000 digital signal controllers family. The first part roughly describes an AC induction motor controlling and regulation techniques. Later on the control software optimization basics are covered. Particular attention is payed for trigonometric functions which are mandatory for such software. Next part shows practical use of the previously described optimization techniques using an example of the scalar frequency inverter control even going down to the assembly instructions level. At the end the results themselves as well as facing the invested price of optimization are discussed.
|
|
|
Instrumentation of C/C++ Programs during Compilation
Mušková, Kateřina ; Peringer, Petr (referee) ; Smrčka, Aleš (advisor)
This thesis presents design and implementation of the TforcTool offering compile-time instrumentation of memory access and functions. The tool is built on an existing static instrumenting tool Tforc, which was extended in order to provide greater usability and functionality. The advantage of this solution compared to another compile-time tools is that there is no need to change current compile structure of project.
|
|
|
Multi-Level Automata and Their Applications
Pšenák, Kamil ; Tomko, Martin (referee) ; Meduna, Alexandr (advisor)
In this thesis, we will add to already known fnite automata paradigm. We start with basic defnitions used in theoretical informatics. Afterwards we defne multi-level fnite automata, which is the base of this thesis. Then we move on to the compilation process and construction of a compiler. With that we defne lexical analysis as our example for multi-level fnite automata implementation. Once we implement the concept, we compare the new and the old way. Then we dig deeper into theoretical informatics to defne parallel right-linear grammars and languages. To prove a concept we create another concept with implementation strategy, using multi-level framework. Lastly, we mention some other areas in informatics, where this multi-level concept could be useful.
|
|
|
Simulation of phenomena in switchgears
Daševič, Ladislav ; Vávra, Zdeněk (referee) ; Valenta, Jiří (advisor)
Aim of the thesis is to explain the issue of forces acting in circuit breaker caused by magnetic fields induced by short-circuit current. This thesis is focused on force affecting in concrete system of a circuit breaker. The given circuit breaker is made by OEZ Letohrad, the type Modeion BD250. In the thesis the way of creating 3-D model is shown for the purpose of creating numeric simulation by ANSYS 11. The next approach of the thesis is the description of applicating the results for DC and AC current calculations. The noted calculation is made in the programme MATLAB 6.5. The solutions are mentioned at calculations both in the graphic form and numeric specifications. Visualisation was made by using GIF graphic system animation. The individual pictures processing was done in the programme UNLEAD GIF ANIMATOR 5.
|
|
|
Build Parallelization in Jenkins Environmnent
Lukášová, Michaela ; Zachariášová, Marcela (referee) ; Dolíhal, Luděk (advisor)
The goal of this bachelor's thesis is parallelization of building Codasip Studio, highly automated developement environment. It focuses on parallelization in Jenkins environment. The implemented solution is mainly focused on speeding up the actual build process. The solution uses a number of Jenkins plugins and several shell scripts, which ensures start of compilation, installation or creation of the final package.
|
|
|
The Parallelization of a Compilation and Linking Process
Koláček, Vojtěch ; Vašíček, Zdeněk (referee) ; Slaný, Karel (advisor)
This bachelor's thesis deals with the parallelization of a compilation and linking process. Various tools for the automatization of the compilation process are discussed. The main criteria is focused on the ability of parallelization of the compilation process. Three systems which are able to parallelize the compilation process have been implemented. The implemented systems cooperate with Microsoft C/C++ Compiler and Intel C++ Compiler.
|
|
|
Instrumentation of C/C++ Programs during Compilation
Mušková, Kateřina ; Peringer, Petr (referee) ; Smrčka, Aleš (advisor)
This thesis presents design and implementation of the TforcTool offering compile-time instrumentation of memory access and functions. The tool is built on an existing static instrumenting tool Tforc, which was extended in order to provide greater usability and functionality. The advantage of this solution compared to another compile-time tools is that there is no need to change current compile structure of project.
|
|
|
From abstract to executable plans
Wiesner, Robert ; Barták, Roman (advisor) ; Švancara, Jiří (referee)
This thesis delves into postprocesing on plans for Multi Agent Path Finding. The intent behind postprocesing is to chang the plans so they can be performed by real robots. Changes include reduction in wasted time and introduction of robustness. This thesis proposes five algorithms (later extended to ten), through which MAPF plans are being transfered to a significantly lower level of abstraction. Results were tested on sixty plans created by MAPF solver MAPF Scenatio over five maps. Some resulting plans were tested in real life on robots Ozobot Evo. Results indicate that significantly lower makespan and greater robustness can be achieved through postprocessing. This study also indicates that various algorithms are more effective for certain types of plans.
|
|
|
Compilation-based Approaches for Automated Planning
Pantůčková, Kristýna ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
One of the possible approaches to automated planning is compilation to sat- isfiability or constraint satisfaction. Compilation enables to take advantage of the advancement of SAT or CSP solvers. In this thesis, we implement three of the encodings recently proposed for compilation of planning problems: the model TCPP, the R2 ∃-Step encoding and the Reinforced Encoding. All these approaches search for parallel plans; however, since they use different definitions of parallel step and different variables and constraints, we decided to compare their per- formance on standard benchmarks from international planning competitions. As the R2 ∃-Step encoding was not suitable for our implementation, we present a mod- ified version of this encoding with a reduced number of variables and constraints. We also demonstrate how different definitions of parallel step in the Reinforced Encoding affect the performance. Furthermore, we suggest redundant constraints extending these encodings. Although they did not prove to be beneficial in gen- eral, they could slightly improve the performance on some benchmarks, especially in the R2 ∃-Step encoding.
|
guest ::
